Performance Evaluation and Comparison of GA, SA & LSA Based Algorithms for Standard Cell Placement in VLSI Design
نویسنده
چکیده
Performance Evaluation and Comparison of GA, SA & LSA Based Algorithms for Standard Cell Placement in VLSI Design Dr. Aaquil Bunglowala, Dr. Nidhi Asthana Department of Electronics and Telecommunication Department of Engineering Mathematics MPSTME, Shirpur Campus,Maharashtra, SAIT,Indore, M.P. INDIA __________________________________________________________________________________________ Abstract: This paper deals with the concept of hybridization and reports application of hybridizing on GA, SA and LSA. These algorithms were independently used to solve the standard cell placement problem [3,4,5]. In the first section we present a new hybrid technique of SA and GA named Parallelized SA & GA (SAGAP) of different versions for SCP problem. Then we discuss a hybrid technique of GA and LSA named Memetic Algorithm (MA). We compare the results of wire length and CPU time in association with SCP problems from hybrid systems of SA,GA and LSA
منابع مشابه
An Improved Standard Cell Placement Methodology using Hybrid Analytic and Heuristic Techniques
In recent years, size of VLSI circuits is dramatically grown and layout generation of current circuits has become a dominant task in design flow. Standard cell placement is an effective stage of physical design and quality of placement affects directly on the performance, power consumption and signal immunity of design. Placement can be performed analytically or heuristically. Analytical placer...
متن کاملA Fast Neural{Network Algorithm for Cell Placement
|Cell placement is an important phase of current VLSI circuit design styles as standard cell, gate array, and Field Programmable Gate Array (FPGA). Although nondeterministic algorithms such as Simulated Annealing (SA) have been successful in solving this problem, they are known to be slow. In this paper, we propose a neural network algorithm that produces solutions as good as SA in substantiall...
متن کاملPii: S0893-6080(98)00089-6
Cell placement is an important phase of current VLSI circuit design styles such as standard cell, gate array, and Field Programmable Gate Array (FPGA). Although nondeterministic algorithms such as Simulated Annealing (SA) were successful in solving this problem, they are known to be slow. In this paper, a neural network algorithm is proposed that produces solutions as good as SA in substantiall...
متن کاملParallel Evolutionary Algorithms for Multiobjective Placement Problem
Non-deterministic iterative heuristics such as Tabu Search (TS), Simulated Evolution (SimE), Simulated Annealing (SA), and Genetic Algorithms (GA) are being widely adopted to solve a range of hard optimization problems [1]. This interest is attributed to their generality, ease of implementation, and their ability to deliver high quality results. However, depending on the size of the problem, su...
متن کاملPMU Placement Methods in Power Systems based on Evolutionary Algorithms and GPS Receiver
In this paper, optimal placement of Phasor Measurement Unit (PMU) using Global Positioning System (GPS) is discussed. Ant Colony Optimization (ACO), Simulated Annealing (SA), Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) are used for this problem. Pheromone evaporation coefficient and the probability of moving from state x to state y by ant are introduced into the ACO. The modifi...
متن کامل